Acyclic Constraint Logic and Games
نویسندگان
چکیده
Non-deterministic Constraint Logic is a family of graph games introduced by Demaine and Hearn that facilitates the construction of complexity proofs. It is convenient for the analysis of games, providing a uniform view. We focus on the acyclic version, apply this to Klondike, Mahjong Solitaire and Nonogram (that requires planarity), and discuss the more complicated game of Dou Shou Qi. While for the first three games we reobtain known characterizations in a simple and uniform manner, the result for Dou Shou Qi is new.
منابع مشابه
Interval Propagation on Directed Acyclic Graphs Interval Propagation and Search on Directed Acyclic Graphs for Numerical Constraint Solving
The fundamentals of interval analysis on directed acyclic graphs (DAGs) for global optimization and constraint propagation have recently been proposed by Schichl and Neumaier [2005]. For representing numerical problems, the authors use DAGs whose nodes are subexpressions and whose directed edges are computational flows. Compared to tree-based representations [Benhamou et al. 1999], DAGs offer t...
متن کاملDrawing Graphs by Example E ciently : Trees and Planar Acyclic Digraphs ? ( Extended Abstract )
Constraint-based graph drawing systems provide expressive power and exibility. Previously proposed approaches make use of general constraint solvers, which are ineecient, and of textual speciication of constraints, which can be long and diicult to understand. In this paper we propose the use of a constraint-based visual language for constructing planar drawings of trees, series-parallel graphs,...
متن کاملApplying Scheduling by Edge Reversal to Constraint Partitioning
Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constraint partitioning of Constraint Satisfaction Problems (CSP). In order to apply the SER mechanism, the graph representing the constraints must receive an acyclic orientation. Since obtaining an optimal acyclic orientation ...
متن کاملGames, puzzles, and computation
There is a fundamental connection between the notions of game and of computation. At its most basic level, this is implied by any game complexity result, but the connection is deeper than this. One example is the concept of alternating nondeterminism, which is intimately connected with two-player games. In the first half of this thesis, I develop the idea of game as computation to a greater deg...
متن کاملParallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. I f an FCSP can be represented b y an acyclic constraint network of sire n with width bounded b y a constant then (1) the parallel algorithm takes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ICGA Journal
دوره 37 شماره
صفحات -
تاریخ انتشار 2014